Computational efficiency and universality of timed P systems with active membranes
نویسندگان
چکیده
منابع مشابه
Computational efficiency and universality of timed P systems with active membranes
P systems are a class of computational models inspired by the structure and the functioning of a living cell. In the semantics of P systems, there exists a global clock, which marks the time for the system, and the execution time of each rule takes exactly one time unit. However, in living cells, the execution time of different biochemical reactions is depended on many uncontrollable factors, a...
متن کاملPolarizationless P Systems with Active Membranes: Computational Complexity Aspects
P systems with active membranes, in their classical definition, make use of noncooperative rules only. However, it is well known that in living cells, proteins interact among them yielding new products. Inspired by this biological phenomenon, the previous framework is reformulated in this paper, allowing cooperation in object evolution rules, while removing electrical charges associated with me...
متن کاملPolarizationless P Systems with Active Membranes
The subject of this paper is the continuation of the studies of P systems with active membranes without polarizations with the label-changing capacity of some rules. Rewriting and communication rules that do not change membrane labels can be applied either sequentially or in a maximally parallel way. We consider several classes of P systems and study their generative power. Particularly interes...
متن کاملConstant-Space P Systems with Active Membranes
We continue the investigation of the computational power of spaceconstrained P systems. We show that only a constant amount of space is needed in order to simulate a polynomial-space bounded Turing machine. Due to this result, we propose an alternative definition of space complexity for P systems, where the amount of information contained in individual objects and membrane labels is also taken ...
متن کاملP Systems with Active Membranes Characterize PSPACE
P system is a natural computing model inspired by behavior of living cells and their membranes. We show that (semi-)uniform families of P systems with active membranes can solve in polynomial time exactly the class of problems PSPACE. Consequently, these P systems are computationally equivalent (w.r.t. the polynomial time reduction) to standard parallel machine models as PRAM and the alternatin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.10.051